A Discrete Fourier Transform Approach Searching for Compatible Sequences and Optimal Designs
نویسندگان
چکیده
In this paper, we apply a new method of evaluating the Discrete Fourier Transform that requires significantly less computational effort. In this evaluation, the Discrete Fourier Transform is defined over the support of the sequence of interest. The method can be applied to search for sequences with zero periodic autocorrelation function. As an example we apply the procedure and we were able to classify weighing matrices W (2n, 9) constructed from two sequences of length n and weight (5, 4) for all 400 ≤ n ≤ 500.
منابع مشابه
GENERATION OF MULTIPLE SPECTRUM-COMPATIBLE ARTIFICIAL EARTHQUAKE ACCELEGRAMS WITH HARTLEY TRANSFORM AND RBF NEURAL NETWORK
The Hartley transform, a real-valued alternative to the complex Fourier transform, is presented as an efficient tool for the analysis and simulation of earthquake accelerograms. This paper is introduced a novel method based on discrete Hartley transform (DHT) and radial basis function (RBF) neural network for generation of artificial earthquake accelerograms from specific target spectrums. Acce...
متن کاملPeriod Estimation of the Modulated Signal
− In the paper, the two non-parametric algorithms for the period estimation are compared: the autocorrelation approach and the interpolated discrete Fourier transform (IDFT) approach both added with algorithm for searching of the lowest common frequency component or the largest period of the modulated signal. The direct approach by IDFT shows better results at two and more cycles of the investi...
متن کاملA Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملDetection of high impedance faults in distribution networks using Discrete Fourier Transform
In this paper, a new method for extracting dynamic properties for High Impedance Fault (HIF) detection using discrete Fourier transform (DFT) is proposed. Unlike conventional methods that use features extracted from data windows after fault to detect high impedance fault, in the proposed method, using the disturbance detection algorithm in the network, the normalized changes of the selected fea...
متن کاملA tensor product approach to the abstract partial fourier transforms over semi-direct product groups
In this article, by using a partial on locally compact semi-direct product groups, we present a compatible extension of the Fourier transform. As a consequence, we extend the fundamental theorems of Abelian Fourier transform to non-Abelian case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Informatica (Slovenia)
دوره 36 شماره
صفحات -
تاریخ انتشار 2012